A Neo-Topological Approach to Reasoning on Ontologies with Exceptions and Comparison with Defeasible Description Logics
نویسندگان
چکیده
This article compares Defeasible Description Logics (DDL) and Topological Approach to reason on Ontologies with exceptions. DDL is integration between Description Logics and Defeasible Logics to deal with monotonic and non-monotonic parts of the knowledge bases respectively. Topological approach tries to reason on inconsistent knowledge bases using the conventional topological operators e.g., interior, exterior, border and closure. We develop neo-Topology based on topological operators and we make major development and improvements of current Topological approach by properly introducing the “Thickness Border” with strong inference rules. We proof the validity of the inference rules using set operations. We demonstrate both approaches with appropriate example. We show the advantages and disadvantages of both approaches.
منابع مشابه
Defeasible Inference with Circumscribed OWL Ontologies
The Web Ontology Language (OWL) adheres to the openworld assumption and can thus not be used for forms of nonmonotonic reasoning or defeasible inference, an acknowledged desirable feature in open Semantic Web environments. We investigate the use of the formalism of circumscriptive description logics (DLs) to realise defeasible inference within the OWL framework. By example, we demonstrate how r...
متن کاملAn Argumentative Approach to Reasoning with Inconsistent Ontologies
Standard approaches to reasoning with Description Logics (DL) ontologies require them to be consistent. However, as ontologies are complex entities and sometimes built upon other imported ontologies, inconsistencies can arise. In this paper, we present a framework for reasoning with inconsistent DL ontologies. Our proposal involves expressing DL ontologies as Defeasible Logic Programs (DeLP). G...
متن کاملDIP: A Defeasible-Inference Platform for OWL Ontologies
The preferential approach to nonmonotonic reasoning was consolidated in depth by Krause, Lehmann and Magidor (KLM) for propositional logic in the early 90’s. In recent years, there have been efforts to extend their framework to Description Logics (DLs) and a solid theoretical foundation has already been established towards this aim. Despite this foundation, and the fact that many of the desirab...
متن کاملTowards Defeasible Mappings for Tractable Description Logics (Technical Report)
We present a novel approach to denote mappings between EL-based ontologies which are defeasible in the sense that such a mapping only applies to individuals if this does not cause an inconsistency. This provides the advantage of handling exceptions automatically and thereby avoiding logical inconsistencies that may be caused due to the traditional type of mappings. We consider the case where ma...
متن کاملTowards Practical Defeasible Reasoning for Description Logics
The formalisation of defeasible reasoning in automated systems is becoming increasingly important. Description Logics (DLs) are nowadays the main logical formalism in the field of formal ontologies. Our focus in this paper is to devise a practical implementation for prior work that formalises a version of Rational Closure (an important type of defeasible reasoning) for DLs. We show that the con...
متن کامل